Bose–Einstein condensation in satisfiability problems
نویسندگان
چکیده
منابع مشابه
Bose-Einstein Condensation in Satisfiability Problems
This paper is concerned with the complex behavior arising in satisfiability problems. We present a new statistical physics-based characterization of the satisfiability problem. Specifically, we design an algorithm that is able to produce graphs starting from a k–SAT instance, in order to analyze them and show whether a Bose-Einstein condensation occurs. We observe that, analogously to complex n...
متن کاملDiscrete Optimization Bose–Einstein condensation in satisfiability problems
0377-2217/$ see front matter 2012 Elsevier B.V. A http://dx.doi.org/10.1016/j.ejor.2012.11.039 ⇑ Corresponding author. Tel.: +39 095 738 3048; fa E-mail addresses: [email protected] ( unict.it (A. Occhipinti), [email protected] (G. S unict.it (G. Nicosia). This paper is concerned with the complex behavior arising in satisfiability problems. We present a new statistical physics-ba...
متن کاملBackdoors in Satisfiability Problems
Although satisfiability problems (SAT) are NP-complete, state-of-the-art SAT solvers are able to solve large practical instances. The notion of backdoors has been introduced to capture structural properties of instances. Backdoors are a set of variables for which there exists some value assignment that leads to a polynomial-time solvable sub-problem. I address in this thesis the problem of find...
متن کاملOn the theory of BoseEinstein condensation of quasiparticles: on the possibility of condensation of ferromagnons at high temperatures
The Bose condensation of magnons in physical systems of finite size is considered for the case of ferromagnetic thin films. It is shown that in accordance with present-day experimental capabilities, which permit one to achieve densities of longwavelength spin excitations of ∼ 1018 – 1019 −3 , in such films, the formation of a coherent condensate of such quasiparticles begins at temperatures T ∼...
متن کاملThe Reduction of Satisfiability Problems into 2CNF Satisfiability Problems
Many search techniques are successful in finding solutions to NP-Complete problems in polynomial-time. The search time can be improved upon by sub-dividing the variables and clauses. This sub-division generates data pairs in conjunctive normal form. Then, by using the Two-SAT algorithm, the new subset of data is solved in linear-time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2013
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2012.11.039